Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions
نویسنده
چکیده
Given an intuitionistic proof net of linear logic, we abstract an order between its atomic formulas. From this order, we represent intuitionistic multiplicative proof nets in the more compact form of models of directed acyclic graph descriptions. If we restrict the logical framework to the implicative fragment of intuitionistic linear logic, we show that proof nets reduce to models of tree descriptions.
منابع مشابه
From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions
Deduction graphs [3] provide a formalism for natural deduction, where the deductions have the structure of acyclic directed graphs with boxes. The boxes are used to restrict the scope of local assumptions. Proof nets for multiplicative exponential linear logic (MELL) are also graphs with boxes, but in MELL the boxes have the purpose of controlling the modal operator !. In this paper we study th...
متن کاملAn Algebraic Correctness Criterion for Intuitionistic Multiplicative Proof-Nets
We consider intuitionistic fragments of multiplicative linear logic for which we deene appropriate notions of proof-nets. These are based on a correctness criterion that consists of decorating the nodes of a proof-structure with monoidal terms that must obey constraints reminiscent of phase semantics.
متن کاملProof Nets for Intuitionistic Logic
Until the beginning of the 20th century, there was no way to reason formally about proofs. In particular, the question of proof equivalence had never been explored. When Hilbert asked in 1920 for an answer to this very question in his famous program, people started looking for proof formalizations. Natural deduction and sequent calculi, which were invented by Gentzen in 1935, quickly became two...
متن کاملMulti-paradigm Logic Programming towards a Higher Order Uniication Based on Proof Nets
We study a higher order uniication procedure based on proof nets. In this paper, we present higher order uniication algorithm for intuitionistic implicational multiplicative fragment of proof nets and show termination and soundness for the algorithm.
متن کاملFormulae-as-Resources Management for an Intuitionistic Theorem Prover
This paper outlines new concepts for an alternative implementation of the intuitionistic contraction-free LJT system (and consequently proof search) in imperative programming languages with a good and eecient management of formulae (as resources). Logic programming languages provide natural support to implement automated proof search, without necessity to have explicit knowledge about the form ...
متن کامل